Maximum 2-independent sets of random cubic graphs
نویسنده
چکیده
We present a simple, yet efficient, heuristic for finding a large 2-independent set of cubic graphs. We analyse the performance of this heuristic, which is a randomised greedy algorithm, on random n-vertex cubic graphs using differential equations. In this way, we are able to prove that the expected size of the 2-independent set returned by the algorithm is asymptotically almost surely greater than 0.20485n.
منابع مشابه
Minimum independent dominating sets of random cubic graphs
We present a heuristic for finding a small independent dominating set, D, of cubic graphs. We analyse the performance of this heuristic, which is a random greedy algorithm, on random cubic graphs using differential equations and obtain an upper bound on the expected size of D. A corresponding lower bound is derived by means of a direct expectation argument. We prove that D asymptotically almost...
متن کاملOn the Independence Number of Random Cubic Graphs
We show that as n —> oo, the independence number c*(G), for almost all 3-regular graphs G on n vertices, is at least (61og(3/2) — 2 — e)n, for any constant e > 0. We prove this by analyzing a greedy algorithm for finding independent sets.
متن کاملFractional colorings of cubic graphs with large girth
We show that every (sub)cubic n-vertex graph with sufficiently large girth has fractional chromatic number at most 2.2978 which implies that it contains an independent set of size at least 0.4352n. Our bound on the independence number is valid to random cubic graphs as well as it improves existing lower bounds on the maximum cut in cubic graphs with large girth.
متن کاملA characterisation of cubic parity graphs
A graph is Zm-well-covered if all maximal independent sets have the same cardinality modulo m. Zm-well-covered graphs generalise well-covered graphs, those in which all independent sets have the same cardinality. Z2-well-covered graphs are also called parity graphs. A characterisation of cubic well-covered graphs was given by Campbell, Ellingham and Royle. Here we extend this to a characterisat...
متن کاملMaximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results Using the Local Weak Convergence Method
Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest independent set in G(n, c/n) and Gr(n). The asymptotic value of I(n, c)/n as n → ∞, can be computed using the Karp-Sipser algorithm when c ≤ e. For random cubic graphs, r = 3, it is only known that .432 ≤ lim infn I(n, 3)/n ≤ lim supn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 27 شماره
صفحات -
تاریخ انتشار 2003